An Evaluation of the Sparsity Degree for Sparse Recovery with Deterministic Measurement Matrices
نویسندگان
چکیده
منابع مشابه
A Deterministic Sparse FFT for Functions with Structured Fourier Sparsity
In this paper a deterministic sparse Fourier transform algorithm is presented which breaks the quadratic-in-sparsity runtime bottleneck for a large class of periodic functions exhibiting structured frequency support. These functions include, e.g., the oft-considered set of block frequency sparse functions of the form
متن کاملSparse signal recovery with unknown signal sparsity
In this paper, we proposed a detection-based orthogonal match pursuit (DOMP) algorithm for compressive sensing. Unlike the conventional greedy algorithm, our proposed algorithm does not rely on the priori knowledge of the signal sparsity, which may not be known for some application, e.g., sparse multipath channel estimation. The DOMP runs binary hypothesis on the residual vector of OMP at each ...
متن کاملExploiting Correlation in Sparse Signal Recovery Problems: Multiple Measurement Vectors, Block Sparsity, and Time-Varying Sparsity
A trend in compressed sensing (CS) is to exploit structure for improved reconstruction performance. In the basic CS model (i.e. the single measurement vector model), exploiting the clustering structure among nonzero elements in the solution vector has drawn much attention, and many algorithms have been proposed such as group Lasso (Yuan & Lin, 2006). However, few algorithms explicitly consider ...
متن کاملSparse Recovery with Pre-Gaussian Random Matrices
For an m × N underdetermined system of linear equations with independent pre-Gaussian random coefficients satisfying simple moment conditions, it is proved that the s-sparse solutions of the system can be found by `1-minimization under the optimal condition m ≥ c s ln(eN/s). The main ingredient of the proof is a variation of a classical Restricted Isometry Property, where the inner norm becomes...
متن کاملNonuniform Sparse Recovery with Gaussian Matrices
Compressive sensing predicts that sufficiently sparse vectors can be recovered from highly incomplete information. Efficient recovery methods such as l1-minimization find the sparsest solution to certain systems of equations. Random matrices have become a popular choice for the measurement matrix. Indeed, near-optimal uniform recovery results have been shown for such matrices. In this note we f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Imaging and Vision
سال: 2013
ISSN: 0924-9907,1573-7683
DOI: 10.1007/s10851-013-0453-4